#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 1e6 + 10;
const db eps = 1e-10;
const db tps = 1e-16;

bool cqu(db x, db y) { return fabs(x - y) < eps; }

struct ve {
	db x, y, z;
	ve(db _x, db _y, db _z) : x(_x), y(_y), z(_z) { }
	db len() { return sqrt(x * x + y * y + z * z); }
	friend ve operator - (ve a, ve b) { return ve(a.x - b.x, a.y - b.y, a.z - b.z); }
	friend ve operator + (ve a, ve b) { return ve(a.x + b.x, a.y + b.y, a.z + b.z); }
	friend ve operator * (ve a, db b) { return ve(a.x * b, a.y * b, a.z * b); }
	friend bool operator == (ve a, ve b) {
		return cqu(a.x, b.x) & cqu(a.y, b.y) & cqu(a.z, b.z);
	}
	void set1() { db t = len(); t = 1 / t; x *= t, y *= t, z *= t; }
};

void solve() {
	ve t(0, 0, 0); t.x = in, t.y = in, t.z = in;
	vector < pair < db, ve > > ans;
	auto output = [&]() {
		printf("%d\n", ans.size());
		ve cur(0, 0, 0);
		for(auto v : ans) {
			//if(v.fi < 0) continue;
			ve t = (v.se - cur); db le = min(t.len(), v.fi); t.set1();
			cur = cur + t * le;
		}
		//cerr << "!" << cur.x << " " << cur.y << " " << cur.z << endl;
		//for(auto v : ans) assert(v.fi >= 0 && v.fi <= 10000);
		for(auto v : ans) printf("%.0lf %.0lf %.0lf %.11lf\n", v.se.x, v.se.y, v.se.z, v.fi);
	};
	ve g1(255 + tps, 255 + tps, 255 + tps);
	if(g1 == t) return ans.eb(g1.len(), g1), output();
	auto dt = [&](db x) { return cqu(x, 0) || x < 0 ? 1e4 : x; };
	ve p = g1 - t; p.set1();
	db ret = min({ dt(t.x / p.x), dt(t.y / p.y), dt(t.z / p.z) });
	if(cqu(ret, 1e4) || cqu(t.x, 0) || cqu(t.y, 0) || cqu(t.z, 0)) { }
	else {
		ans.eb(ret, g1); // reverse pos
		t = t - p * ret;
		//cerr << "!G" << t.x << " " << t.y << " " << t.z << endl;
	}
	ve g2 = g1;
	if(cqu(t.x, 0)) g2.x = tps; if(cqu(t.y, 0)) g2.y = tps; if(cqu(t.z, 0)) g2.z = tps;
	//if(t == ve(0, 0, 0)) return output();
	p = g2 - t; p.set1();
	ret = min({ dt(t.x / p.x), dt(t.y / p.y), dt(t.z / p.z) });
	if(cqu(ret, 1e4)) { }
	else {
		ans.eb(ret, g2);
		t = t - p * ret;
		//cerr << "!G" << t.x << " " << t.y << " " << t.z << endl;
	}
	ve g3 = g2;
	if(cqu(t.x, 0)) g3.x = tps; if(cqu(t.y, 0)) g3.y = tps; if(cqu(t.z, 0)) g3.z = tps;
	ans.eb(t.len(), g3);
	g3.set1();
	t = t - g3 * ans.back().fi;
	reverse(ans.begin(), ans.end()); output();
}

int main() {
#ifdef YJR_2333_TEST
	freopen("1.in", "r", stdin);
#endif
	for(int T = in; T; T--) solve(); return 0;
}
